Extended path partition conjecture for semicomplete and acyclic compositions
نویسندگان
چکیده
Let D be a digraph and let λ ( ) denote the number of vertices in longest path . For pair vertex-disjoint induced subdigraphs A B , we say that is partition if V ∪ = The Path Partition Conjecture (PPC) states for every digraph, integer q with 1 ≤ − there exists such T vertex set { u … t } i ∈ [ ] H j : n composition Q arc p We acyclic (semicomplete, respectively) respectively). In this paper, introduce conjecture stronger than PPC using property first studied by Bang-Jensen, Nielsen Yeo (2006) show holds wide families semicomplete compositions.
منابع مشابه
A New Proof of Berge’s Strong Path Partition Conjecture for Acyclic Digraphs
Berge’s elegant strong path partition conjecture from 1982 extends the Greene-Kleitman Theorem and Dilworth’s Theorem for all digraphs. The conjecture is known to be true for all digraphs for k = 1 by the Gallai-Milgram Theorem, and for k > 1 only for acyclic digraphs. We present a simple algorithmic proof for k = 1 which naturally extends to a new algorithmic proof for acyclic digraphs for all...
متن کاملThe directed path partition conjecture
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path with more than λ vertices then, for every pair (a, b) of positive integers with λ = a + b, there exists a vertex partition (A, B) of D such that no path in D〈A〉 has more than a vertices and no path in D〈B〉 has more than b vertices.We develop methods for finding the desired partitions for various cla...
متن کاملThe Path Partition Conjecture for Oriented Graphs
The vertex set and arc set of a digraph D are denoted by V (D) and E (D), respectively, and the number of vertices in a digraph D is denoted by n (D). A directed cycle (path, walk) in a digraph will simply be called a cycle (path, walk). A graph or digraph is called hamiltonian if it contains a cycle that visits every vertex, traceable if it contains a path that visits every vertex, and walkabl...
متن کاملA survey of the Path Partition Conjecture
The Path Partition Conjecture (PPC) states that if G is any graph and (λ1, λ2) any pair of positive integers such that G has no path with more than λ1 + λ2 vertices, then there exists a partition (V1, V2) of the vertex set of G such that Vi has no path with more than λi vertices, i = 1, 2. We present a brief history of the PPC, discuss its relation to other conjectures and survey results on the...
متن کاملThe Path Partition Conjecture is true for claw-free graphs
The detour order of a graph G, denoted by (G), is the order of a longest path in G. The Path Partition Conjecture (PPC) is the following: If G is any graph and (a, b) any pair of positive integers such that (G)= a + b, then the vertex set of G has a partition (A,B) such that (〈A〉) a and (〈B〉) b. We prove that this conjecture is true for the class of claw-free graphs.We also show that to prove t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113019